Construction of planar graphs for IPR fullerenes using 5- and 6-fold rotational symmetry: some eigenspectral analysis
نویسندگان
چکیده
An algorithm has been developed for the construction of planar graphs for two series of IPR fullerenes of the general formula C50þ 10n and C60þ 12n (n 1⁄4 1, 2, 3,. . .) maintaining 5and 6-fold rotational symmetry, respectively. Some important utilities of these graphs have been shown. Simple rules have then been developed for factorising these graphs in order to obtain the eigenvalues corresponding to the totally symmetric irreducible representations of the C5 and C6 subgroups of the full point groups of fullerenes.
منابع مشابه
An Heuristic for Graph Symmetry Detection
We give a short introduction to an heuristic to nd automorphisms in a graph such as axial, central or rotational symmetries. Using technics of factorial analysis, we embed the graph in an Euclidean space and try to detect and interpret the geometric symmetries of of the embedded graph. 1. Introduction Testing whether a graph has any axial (rotational, central, respectively) symmetry is a NP-com...
متن کاملPI, Szeged and Revised Szeged Indices of IPR Fullerenes
In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.
متن کاملComputational determination of character table and symmetry of fullerenes cage as C24 and C28
Fullerene chemistry is nowadays a well-established field of both theoretical and experimental investigations. This study considers the symmetry of small fullerenes cage C24 and C28. Using PM3 program for C24 and C28 fullerenes, Oh and Td symmetry were confirmed, respectively. The mentioned algorithm to compute the automorphism group of these fullerenes with connectivity and geometry of th...
متن کاملThe Generation of Fullerenes
We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes - fullgen - and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers ...
متن کاملNarumi-Katayama Polynomial of Some Nano Structures
The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...
متن کامل